Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines
نویسندگان
چکیده
منابع مشابه
Deletion Operations on Deterministic Families of Automata
Many different deletion operations are investigated applied to languages accepted by one-way and twoway deterministic reversal-bounded multicounter machines, deterministic pushdown automata, and finite automata. Operations studied include the prefix, suffix, infix and outfix operations, as well as left and right quotient with languages from different families. It is often expected that language...
متن کاملThe University of Saskatchewan
Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix, infix, su x and outfix relations. The insertion of regular languages and other languages into deterministic reversal-bounded multicounter languages is also studie...
متن کاملThe University of Saskatchewan Department of Computer Science
Many different deletion operations are investigated applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines as well as finite automata. Operations studied include the prefix, suffix, infix and outfix operations, as well as left and right quotient with languages from different families. It is often expected that language families defined from det...
متن کاملBounded Counter Languages
We show that deterministic finite automata equipped with k two-way heads are equivalent to deterministic machines with a single two-way input head and k− 1 linearly bounded counters if the accepted language is strictly bounded, i.e., a subset of a∗1a ∗ 2 · · · a ∗ m for a fixed sequence of symbols a1, a2, . . . , am. Then we investigate linear speed-up for counter machines. Lower and upper time...
متن کاملUnary Languages Recognized by Two-Way One-Counter Automata
A two-way deterministic finite state automaton with one counter (2D1CA) is a fundamental computational model that has been examined in many different aspects since sixties, but we know little about its power in the case of unary languages. Up to our knowledge, the only known unary nonregular languages recognized by 2D1CAs are those formed by strings having exponential length, where the exponent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 23 شماره
صفحات -
تاریخ انتشار 2011